Completing rule bases in symbolic domains by analogy making
نویسندگان
چکیده
The paper considers the problem of completing a set of parallel if-then rules that provides a partial description of how a conclusion variable depends on the values of condition variables, where each variable takes its value among a finite ordered set of labels. The proposed approach does not require the use of fuzzy sets for the interpretation of these labels or for defining similarity measures, but rather relies on the extrapolation of missing rules on the basis of analogical proportions that hold for each variable between the labels of several parallel rules. The analogical proportions are evaluated for binary and multiple-valued variables on the basis of a logical expression involving Łukasiewicz implication. The underlying assumption is that the mapping partially specified by the given rules is as regular as suggested by these rules. A comparative discussion with other approaches is presented.
منابع مشابه
Fuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring
There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...
متن کاملFuzzy Apriori Rule Extraction Using Multi-Objective Particle Swarm Optimization: The Case of Credit Scoring
There are many methods introduced to solve the credit scoring problem such as support vector machines, neural networks and rule based classifiers. Rule bases are more favourite in credit decision making because of their ability to explicitly distinguish between good and bad applicants.In this paper multi-objective particle swarm is applied to optimize fuzzy apriori rule base in credit scoring. ...
متن کاملCombining Connectionist and Symbolic Learning to Reene Certainty-factor Rule Bases
This paper describes Rapture | a system for revising probabilistic knowledge bases that combines connectionist and symbolic learning methods. Rapture uses a modiied version of backpropagation to reene the certainty factors of a probabilistic rule base and it uses ID3's information-gain heuristic to add new rules. Results on reening three actual expert knowledge bases demonstrate that this combi...
متن کاملRule Based Learning Systems from SVM and RBFNN
Two methods for the symbolic interpretation of both, Support Vector Machines (SVM) and Radial Basis Function Neural Networks (RBFNN) are proposed. These schemes, based on the combination of support vectors and prototype vectors by means of geometry produce rules in the form of ellipsoids and hyper-rectangles. Results obtained from a certain number of experiments on artificial and real data base...
متن کاملBehavior-Based Analogy-Making
Most everyone, including the experts, would agree that analogy-making is best defined as a process that creates a mapping between items in one domain (often called the source) to “similar” items in another domain (often called the target). Based on this definition, many researchers have attempted to model analogy-making by creating a mapping between two sets of data structures that represent th...
متن کامل